L(2, 1)L(2, 1)-labeling of oriented planar graphs

نویسندگان

  • Tiziana Calamoneri
  • Blerina Sinaimeri
چکیده

In this paper we study the L(2, 1)-labeling problem on oriented planar graphs with particular attention on the subclasses of oriented prisms, Halin and cactus graphs. For these subclasses more accurate results are presented. keywords: L(2, 1)-labeling, oriented graph coloring, digraphs, prisms, Halin graphs, cacti.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

L(2, 1)-Labeling of Oriented Planar Graphs

In this paper we study the L(2, 1)-labeling problem on oriented planar graphs with particular attention on the subclasses of oriented prisms, Halin and cactus graphs. For these subclasses more accurate results are presented. keywords: L(2, 1)-labeling, oriented graph coloring, digraphs, prisms, Halin graphs, cacti.

متن کامل

L(2, 1)-labelings of some famillies of oriented planar graphs

In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.

متن کامل

L(2, 1)-labelings of Some Families of Oriented Planar Graphs

In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.

متن کامل

2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs

In this paper, we improve the existing bounds [2] for 2-dipath and oriented L(2, 1) span for the class of planar graphs with girth 5, 11, 16, cactus, wheels and leaf independent Halin graphs. Some of these bounds are tight.

متن کامل

L(h, 1)-labeling subclasses of planar graphs

L(h, 1)-labeling, h = 0, 1, 2, is a class of coloring problems arising from frequency assignment in radio networks, in which adjacent nodes must receive colors that are at least h apart while nodes connected by a two long path must receive different colors. This problem is NP-complete even when limited to planar graphs. Here, we focus on L(h, 1)-labeling restricted to regular tilings of the pla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 161  شماره 

صفحات  -

تاریخ انتشار 2013